An Algorithm for Minimal Insertion in a Type Lattice

An Algorithm for Minimal Insertion in a Type Lattice 3

2 The problem of inserting a new element x into a lattice of types L is addressed in the paper. As the poset L + x obtained by the direct insertion of x in L, is not necessarily a lattice, some set of auxiliary elements should be added to restore the lattice properties. An approach towards the lattice insertion is presented which allows the set of auxiliary elements to be kept minimal. The key ...

An Algorithm for Minimal Insertion in a Type Lattice

We consider the insertion of a new element x in a lattice of types L. As the poset L + x obtained by the direct insertion of x in L, is not necessarily a lattice, a set of auxiliary elements should be added in order to restore the lattice properties. We describe an approach towards the lattice insertion based on a global deenition of the set of necessary auxiliary elements and their location in...

An Algorthm for Minimal Insertion in a Type Lattice

A minimal, rotation-based FRLS lattice algorithm

We propose an alternate Givens rotation-based least-squares lattice algorithm. Based on spherical trigonometry principles, this algorithm turns out to be a normalized version of the fast QRD-based least-squares lattice filter, introduced independently by Ling and by Proudler et al. In constrast with that algorithm, the storage requirements of the new algorithm are minimal (in the system theory ...

a cauchy-schwarz type inequality for fuzzy integrals

نامساوی کوشی-شوارتز در حالت کلاسیک در فضای اندازه فازی برقرار نمی باشد اما با اعمال شرط هایی در مسئله مانند یکنوا بودن توابع و قرار گرفتن در بازه صفر ویک می توان دو نوع نامساوی کوشی-شوارتز را در فضای اندازه فازی اثبات نمود.